Analysis of join-the-shortest-queue routing for web server farms
نویسندگان
چکیده
Join the Shortest Queue (JSQ) is a popular routing policy for server farms. However, until now all analysis of JSQ has been limited to First-Come-First-Serve (FCFS) server farms, whereas it is known that web server farms are better modeled as Processor Sharing (PS) server farms. We provide the first approximate analysis of JSQ in the PS server farm model for general job size distributions, obtaining the distribution of queue length at each queue. To do this, we approximate the queue length of each queue in the server farm by a one-dimensional Markov chain, in a novel fashion. We also discover some interesting insensitivity properties for PS server farms with JSQ routing, and discuss the near-optimality of JSQ.
منابع مشابه
Approximate performance analysis of generalized join the shortest queue routing
In this paper we propose a highly accurate approximate performance analysis of a heterogeneous server system with a processor sharing (PS) service discipline and a general job-size distribution under a generalized join the shortest queue (GJSQ) routing protocol. The GJSQ routing protocol is a natural extension of the well-known join the shortest queue (JSQ) routing policy that takes into accoun...
متن کاملOn Two-Echelon Multi-Server Queue with Balking and Limited Intermediate Buffer
In this paper we study two echelon multi-server tandom queueing systems where customers arrive according to a poisson process with two different rates. The service rates at both echelons are independent of each other. The service times of customers is assumed to be completed in two stages. The service times at each stage are exponentially distributed. At the first stage, the customers may balk ...
متن کاملScheduling Multi-Server Systems Using Foreground-Background Processing
It is known that foreground-background processor sharing (FBPS) stochastically minimizes the number in the system with a single server when task processing times follow a Decreasing Failure Rate(DFR) distribution. Based on this, we derive an optimal policy for a system with a common queue for several identical servers. The performance of such a system will provide a lower bound for the loosely ...
متن کاملUnreliable Server Mx/G/1 Queue with Loss-delay, Balking and Second Optional Service
This investigation deals with MX/G/1 queueing model with setup, bulk- arrival, loss-delay and balking. The provision of second optional service apart from essential service by an unreliable server is taken into consideration. We assume that the delay customers join the queue when server is busy whereas loss customers depart from the system. After receiving the essential service, the customers m...
متن کاملSteady-state analysis of shortest expected delay routing
We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue promising the shortest expected delay, which is a natural and near-optimal policy for systems with non-identical servers. This system can be modeled as an i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Perform. Eval.
دوره 64 شماره
صفحات -
تاریخ انتشار 2007